RANDOMIZED DIVIDE-AND-CONQUER: IMPROVED PATH, MATCHING, AND PACKING ALGORITHMSCHEN, Jianer; KNEIS, Joachim; LU, Songjian et al.SIAM journal on computing (Print). 2009, Vol 38, Num 6, pp 2526-2547, issn 0097-5397, 22 p.Article

SMALL-SIZE ε-NETS FOR AXIS-PARALLEL RECTANGLES AND BOXESARONOV, Boris; EZRA, Esther; SHARIR, Micha et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3248-3282, issn 0097-5397, 35 p.Article

VISION-BASED PURSUIT-EVASION IN A GRIDDUMITRESCU, Adrian; KOK, Howi; SUZUKI, Ichiro et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 1177-1204, issn 0895-4801, 28 p.Article

ESTIMATING THE WEIGHT OF METRIC MINIMUM SPANNING TREES IN SUBLINEAR TIMECZUMAJ, Artur; SOHLER, Christian.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 904-922, issn 0097-5397, 19 p.Article

Online conflict-free coloring for intervalsCHEN, K. E; FIAT, Amos; WELZL, Emo et al.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1342-1359, issn 0097-5397, 18 p.Article

ONLINE SCHEDULING OF EQUAL-LENGTH JOBS : RANDOMIZATION AND RESTARTS HELPCHROBAK, Marek; JAWOR, Wojciech; SGALL, Jiri et al.SIAM journal on computing (Print). 2007, Vol 36, Num 6, pp 1709-1728, issn 0097-5397, 20 p.Article

STREAM ORDER AND ORDER STATISTICS: QUANTILE ESTIMATION IN RANDOM-ORDER STREAMSGUHA, Sudipto; MCGREGOR, Andrew.SIAM journal on computing (Print). 2009, Vol 38, Num 5, pp 2044-2059, issn 0097-5397, 16 p.Article

Deterministic extractors for bit-fixing sources and exposure-resilient cryptographyKAMP, Jesse; ZUCKERMAN, David.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1231-1247, issn 0097-5397, 17 p.Article

All-pairs nearly 2-approximate shortest paths in O(n²polylog n) timeBASWANA, Surender; GOYAL, Vishrut; SEN, Sandeep et al.Theoretical computer science. 2009, Vol 410, Num 1, pp 84-93, issn 0304-3975, 10 p.Article

ALGORITHMIC ASPECTS OF PROPERTY TESTING IN THE DENSE GRAPHS MODELGOLDREICH, Oded; RON, Dana.SIAM journal on computing (Print). 2011, Vol 40, Num 2, pp 376-445, issn 0097-5397, 70 p.Article

On randomized algorithms for the majority problemCHRISTOFIDES, Demetres.Discrete applied mathematics. 2009, Vol 157, Num 7, pp 1481-1485, issn 0166-218X, 5 p.Article

An approximate L¹-difference algorithm for massive data streamsFEIGENBAUM, Joan; KANNAN, Sampath; STRAUSS, Martin J et al.SIAM journal on computing (Print). 2003, Vol 32, Num 1, pp 131-151, issn 0097-5397, 21 p.Article

Online multi-coloring on the path revisitedCHRIST, Marie G; FAVRHOLDT, Lene M; LARSEN, Kim S et al.Acta informatica. 2013, Vol 50, Num 5-6, pp 343-357, issn 0001-5903, 15 p.Article

A shortest cycle for each vertex of a graphYUSTER, Raphael.Information processing letters. 2011, Vol 111, Num 21-22, pp 1057-1061, issn 0020-0190, 5 p.Article

Improved artificial bee colony algorithm for global optimizationWEIFENG GAO; SANYANG LIU.Information processing letters. 2011, Vol 111, Num 17, pp 871-882, issn 0020-0190, 12 p.Article

Quasi-random rumor spreading: Reducing randomness can be costlyDOERR, Benjamin; FOUZ, Mahmoud.Information processing letters. 2011, Vol 111, Num 5, pp 227-230, issn 0020-0190, 4 p.Article

NEAR OPTIMAL BOUNDS FOR STEINER TREES IN THE HYPERCUBETAO JIANG; MILLER, Zevi; PRITIKIN, Dan et al.SIAM journal on computing (Print). 2011, Vol 40, Num 5, pp 1340-1360, issn 0097-5397, 21 p.Article

A note on the search for k elements via quantum walkDÖRN, Sebastian; THIERAUF, Thomas.Information processing letters. 2010, Vol 110, Num 22, pp 975-978, issn 0020-0190, 4 p.Article

APPROXIMATE HYPERGRAPH PARTITIONING AND APPLICATIONSFISCHER, Eldar; MATSLIAH, Arie; SHAPIRA, Asaf et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3155-3185, issn 0097-5397, 31 p.Article

SIMULATING QUANTUM COMPUTATION BY CONTRACTING TENSOR NETWORKSMARKOV, Igor L; YAOYUN SHI.SIAM journal on computing (Print). 2009, Vol 38, Num 3, pp 963-981, issn 0097-5397, 19 p.Article

Feedback arc set problem in bipartite tournamentsGUPTA, Sushmita.Information processing letters. 2008, Vol 105, Num 4, pp 150-154, issn 0020-0190, 5 p.Article

RANGE-EFFICIENT COUNTING OF DISTINCT ELEMENTS IN A MASSIVE DATA STREAMPAVAN, A; TIRTHAPURA, Srikanta.SIAM journal on computing (Print). 2008, Vol 37, Num 2, pp 359-379, issn 0097-5397, 21 p.Article

A note on the distribution of the number of prime factors of the integersSRINIVASAN, Aravind.Information processing letters. 2008, Vol 109, Num 2, pp 133-135, issn 0020-0190, 3 p.Article

A CHARACTERIZATION OF THE (NATURAL) GRAPH PROPERTIES TESTABLE WITH ONE-SIDED ERRORALON, Noga; SHAPIRA, Asaf.SIAM journal on computing (Print). 2008, Vol 37, Num 6, pp 1703-1727, issn 0097-5397, 25 p.Article

Fast monte carlo algorithms for matrices III: Computing a compressed approximate matrix decompositionDRINEAS, Petros; KANNAN, Ravi; MAHONEY, Michael W et al.SIAM journal on computing (Print). 2007, Vol 36, Num 1, pp 184-206, issn 0097-5397, 23 p.Article